TECHNICAL CONTRIBUTIONS. FINDING NEGATIVE CYCLES = CONTRIBUTIONS TECHNIQUES. RECHERCHE DES CYCLES NEGATIFSKLEIN M; TIBREWALA RK.1973; INFOR.; CANADA; DA. 1973; VOL. 11; NO 1; PP. 59-65; ABS. FR.; BIBL. 8 REF.Serial Issue

ALGOL-PROZEDUREN FUER ZWEI VERFAHREN ZUR SUCHE NEGATIVER ZYKLEN IN BEWERTETEN DIGRAPHEN = PROCEDURES ALGOL POUR DEUX METHODES DE DETECTION DE CYCLES NEGATIFS DANS DES GRAPHES ORIENTES VALUESDOMSCHKE W.1973; COMPUTING; AUSTR.; DA. 1973; VOL. 11; NO 2; PP. 169-173; ABS. ANGL.; BIBL. 1 REF.Serial Issue

ZWEI VERFAHREN ZUR SUCHE NEGATIVER ZYKLEN IN BEWERTETEN DIGRAPHEN = DEUX ALGORITHMES POUR DETECTER LES CYCLES NEGATIFS DANS UN GRAPHE ORIENTE VALUEDOMSCHKE W.1973; COMPUTING; AUSTR.; DA. 1973; VOL. 11; NO 2; PP. 125-136; ABS. ANGL.; BIBL. 14 REF.Serial Issue

On signed digraphs with all cycles negativeHARRARY, F; LUNDGREN, J. R; MAYBEE, J. S et al.Discrete applied mathematics. 1985, Vol 12, Num 2, pp 155-164, issn 0166-218XArticle

DISTRIBUTED COMPUTATION ON GRAPHS: SHORTEST PATH ALGORITHMSCHANDY KM; MISRA J.1982; COMMUNICATIONS OF THE A.C.M.; ISSN 0001-0782; USA; DA. 1982; VOL. 25; NO 11; PP. 833-837; BIBL. 2 REF.Article

Negative cycle detection problemWONG, Chi-Him; TAM, Yiu-Cheong.Lecture notes in computer science. 2005, pp 652-663, issn 0302-9743, isbn 3-540-29118-0, 1Vol, 12 p.Conference Paper

All-pairs shortest-paths computation in the presence of negative cyclesMEHLHORN, Kurt; PRIEBE, Volker; SCHÄFER, Guido et al.Information processing letters. 2002, Vol 81, Num 6, pp 341-343, issn 0020-0190Article

Bounded discrete representations of interval ordersISAAK, G.Discrete applied mathematics. 1993, Vol 44, Num 1-3, pp 157-183, issn 0166-218XArticle

Shortest path and closure algorithms for banded matricesALLISON, L; DIX, T. I; YEE, C. N et al.Information processing letters. 1991, Vol 40, Num 6, pp 317-322, issn 0020-0190Article